Optimal Freeze Cycle Length for Renal Cryotherapy
نویسندگان
چکیده
منابع مشابه
Cryotherapy of proliferative sickle retinopathy, II: triple freeze-thaw cycle.
Complete closure of retinal neovascularisation due to proliferative sickle cell retinopathy was achieved in 28 'sea fans' (areas of neovascularisation) in 9 eyes of 9 patients by means of a triple freeze-thaw technique. However, 2 eyes developed subsequent rhegmatogenous retinal detachments, presumably related to vitreous traction on necrotic retina. We therefore recommend photocoagulation as...
متن کاملRetroperitoneal and transperitoneal laparoscopic cryotherapy for small renal masses.
OBJECTIVE Cryotherapy is a minimally invasive ablative technique that is considered an alternative to conventional surgery for preserving renal function in small renal tumors and in selected cases. We present our results from laparoscopic renal cryotherapy. MATERIAL AND METHOD We retrospectively analyzed 17 renal tumors diagnosed in 16 patients treated with cryotherapy. The patients' mean age...
متن کاملA Simulation Study to Derive the Optimal Cycle Length for Feeder Transit Services
This paper presents a simulation study to evaluate the capacity and the optimum service cycle time of a demand responsive transit “feeder” service within the colonia of El Cenizo, TX. Demand data are taken from a survey questionnaire conducted to evaluate the existing travel patterns and the potential demand for a feeder service. Results showed that a single shuttle would be able to comfortably...
متن کاملOn α-resolvable directed cycle systems for cycle length 4
A directedm-cycle system of order v with index λ, denotedm-DCS(v, λ), is a collection of directed cycles of length m whose directed edges partition the directed edges of λDKv. An m-DCS(v, λ) is α-resolvable if its directed cycles can be partitioned into classes such that each point of the design occurs in precisely α cycles in each class. The necessary conditions for the existence of such a des...
متن کاملNew length bounds for cycle bases
Based on a recent work by Abraham, Bartal and Neiman (2007), we construct a strictly fundamental cycle basis of length O(n) for any unweighted graph, whence proving the conjecture of Deo et al. (1982). For weighted graphs, we construct cycle bases of length O(W ·logn log logn), where W denotes the sum of the weights of the edges. This improves the upper bound that follows from the result of Elk...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Urology
سال: 2011
ISSN: 0022-5347,1527-3792
DOI: 10.1016/j.juro.2011.03.034